Compact Rewritings for Existential Rules
نویسنده
چکیده
Querying large databases while taking ontologies into account is currently a very active domain research. In this paper, we consider ontologies described by existential rules (also known as Datalog+/-), a framework that generalizes lightweight description logics. A common approach is to rewrite a conjunctive query w.r.t an ontology into a union of conjunctive queries (UCQ) which can be directly evaluated against a database. However, the practicability of this approach is questionable due to 1) the weak expressivity of classes for which efficient rewriters have been implemented 2) the large size of optimal rewritings using UCQ. We propose to use semi-conjunctive queries (SCQ), which are a restricted form of positive existential formulas, and compute sound and complete rewritings, which are union of SCQ (USCQ). A novel algorithm for query rewriting, COMPACT, is presented. It computes sound and complete rewritings for large classes of ontologies. First experiments show that USCQ are both efficiently computable and more efficiently evaluable than their equivalent UCQ.
منابع مشابه
Compact Rewriting for Existential Rules
Querying large databases while taking ontologies into account is currently a very active domain research. In this paper, we consider ontologies described by existential rules (also known as Datalog+/-), a framework that generalizes lightweight description logics. A common approach is to rewrite a conjunctive query w.r.t an ontology into a union of conjunctive queries (UCQ) which can be directly...
متن کاملPolynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations
متن کامل
Query Rewriting for Existential Rules with Compiled Preorder
We address the issue of Ontology-Based Query Answering (OBQA), which seeks to exploit knowledge expressed in ontologies when querying data. Ontologies are represented in the framework of existential rules (aka Datalog±). A commonly used technique consists in rewriting queries into unions of conjunctive queries (UCQs). However, the obtained queries can be prohibitively large in practice. A well-...
متن کاملExponential Lower Bounds and Separation for Query Rewriting
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of firstorder and nonrecursive Datalog rewritings for conjunctive queries over OWL2QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we ...
متن کاملQuery Rewriting over Shallow Ontologies
We investigate the size of conjunctive query rewritings over OWL2QL ontologies of depth 1 and 2 by means of a new formalism, called hypergraph programs, for computing Boolean functions. Both positive and negative results are obtained. All conjunctive queries over ontologies of depth 1 have polynomial-size nonrecursive datalog rewritings; tree-shaped queries have polynomial-size positive existen...
متن کامل